An iterative combinational logic synthesis technique using spectral information

نویسندگان

  • Mitchell A. Thornton
  • Suku Nair
چکیده

The spectral information of a Boolean function provides data regarding the correlation between the input variables and the output of the function. This paper introduces a spectral based methodology for com-binational logic synthesis using linear transforms. An analysis of the properties of the spectra obtained from these transforms is provided and a synthesis algorithm using spectral techniques is presented. This result is signiicant since it provides an algebraic method for including XOR gates in the synthesis process without resorting to manipulation of symbolic Boolean equations .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The hierarchical timing pair model

We present a new model for representing timing information for functions in High-Level Synthesis (HLS). We identify shortcomings of the conventional timing model, which is a very simple model derived from the combinational logic model, and show that our new model overcomes many of these defects. In particular, we are able to provide a unified timing model that describes hierarchical combination...

متن کامل

Fuzzified Simulated Evolution Algorithm for Combinational Digital Logic Design Targeting Multi-objective Optimization

In this paper, we employ fuzzified Simulated Evolution (SimE) algorithm for combinational digital logic design targeting area, delay and power as objectives. This technique is considered to be an evolutionary technique in logic design compared to conventional technique which uses deterministic algorithms for logic design. The performance of the proposed algorithm is evaluated using selected ISC...

متن کامل

Self-Timed Realization of Combinational Logic

A novel synthesis method for self-timed realization of arbitrary combinational logic functions is presented in this paper. The cost of self-timed implementation of a large number of conventional combinatorial benchmarks is provided. A new self-timed system configuration is also proposed in support of the synthesis heuristic that generally favors weakly indicating realizations of combinational l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993